On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.Comment: V3: extensively rewritten. V4: a mistaken reference to a conjecture by Kraus and Cirac [quant-ph/0011050] removed and a mistake in the order of authors in Ref. [53] correcte

A rocket-borne pulse-height analyzer for energetic particle measurements

The pulse-height analyzer basically resembles a time-sharing multiplexing data-acquisition system which acquires analog data (from energetic particle spectrometers) and converts them into digital code. The PHA simultaneously acquires pulse-height information from the analog signals of the four input channels and sequentially multiplexes the digitized data to a microprocessor. The PHA together with the microprocessor form an on-board real-time data-manipulation system. The system processes data obtained during the rocket flight and reduces the amount of data to be sent back to the ground station. Consequently the data-reduction process for the rocket experiments is speeded up. By using a time-sharing technique, the throughput rate of the microprocessor is increased. Moreover, data from several particle spectrometers are manipulated to share one information channel; consequently, the TM capacity is increased

Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions

We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity.Comment: 5 pages, 1 figure; minor corrections, conjecture adde

New geometries for high spatial resolution hall probes

The Hall response function of symmetric and asymmetric planar Hall effect devices is investigated by scanning a magnetized tip above a sensor surface while simultaneously recording the topography and the Hall voltage. Hall sensor geometries are tailored using a Focused Ion Beam, in standard symmetric and new asymmetric geometries. With this technique we are able to reduce a single voltage probe to a narrow constriction 20 times smaller than the other device dimensions. We show that the response function is peaked above the constriction, in agreement with numerical simulations. The results suggest a new way to pattern Hall sensors for enhanced spatial resolution.Comment: 12 pages, 5 figures, submitted to Journal of Applied Physic

Prescription for experimental determination of the dynamics of a quantum black box

We give an explicit prescription for experimentally determining the evolution operators which completely describe the dynamics of a quantum mechanical black box -- an arbitrary open quantum system. We show necessary and sufficient conditions for this to be possible, and illustrate the general theory by considering specifically one and two quantum bit systems. These procedures may be useful in the comparative evaluation of experimental quantum measurement, communication, and computation systems.Comment: 6 pages, Revtex. Submitted to J. Mod. Op

Simple proof of fault tolerance in the graph-state model

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known bounds in the circuit model under the same noise process.Comment: 6 pages, 2 figures, REVTeX4. (v4): Minor revisions and new title; published versio